Strassen's matrix multiplication for customisable processors
نویسندگان
چکیده
Strassen S algorithm is an efficient method for mulliplying large matrices. We explore various ways of mapping Strassen ' s algorithm inlo reconfgurable hardware that contains one or more customisable instruction processors. Our approach has been implemented using Nios processors with custom inslrucfions and with custom-designed coprocessors, taking advantage of the additional logic and memory blocb available on a reconfgurable platform.
منابع مشابه
Architecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms Architecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms
Many fast algorithms in arithmetic complexity have hierarchical or recursive structures that make eecient implementations on high performance computers with memory hierarchies non-trivial. In this paper we present our ndings on eecient implementation of Strassen's algorithmm17] for the ubiquitous operation of matrix multiplication as a model for a class of recursive algorithms. In comparison to...
متن کاملA three-dimensional approach to parallel matrix multiplication
A three-dimensional (3D) matrix multiplication algorithm for massively parallel processing systems is presented. The P processors are configured as a "virtual" processing cube with dimensions pl, p2, and p3 proportional to the matrices' dimensions-M, N, and K. Each processor performs a single local matrix multiplication of size Mlp, x Nlp, x Wp,. Before the local computation can be carried out,...
متن کاملCombining building blocks for parallel multi-level matrix multiplication
EXTENDED ABSTRACT Matrix-matrix multiplication is one of the core computations in many algorithms from scientific computing or numerical analysis and many efficient realizations have been invented over the years, including many parallel ones. The current trend to use clusters of PCs or SMPs for scientific computing suggests to revisit matrix-matrix multiplication and investigate efficiency and ...
متن کاملNaïve Matrix Multiplication versus Strassen Algorithm in Multi-thread Environment
Naivno množenje matrica In the first section, we will give mathematical reasoning of Strassen's alghoritm for matrix multiplication. First a naïve method for matrix multiplication is explained, and then it is extended to more advanced Strassen's method. In the following section a description of programming language and framework is given, with explanation of the algorithm's implementation. Last...
متن کاملA BSP Realisation of Strassen's Algorithm
An eecient BSP realisation of Strassen's matrix multiplication algorithm is described. 1 Strassen's Algorithm Let A and B be two n n matrices and consider the problem of computing C = A B. We can regard the matrices A; B; C as each composed of four n=2 n=2 submatrices. For example, ! If the submatrices of B and C are described in the same way then we have C ij = A i0 B 0j + A i1 B 1j for all i;...
متن کامل